Joint Orders in Comparative Probability
نویسندگان
چکیده
منابع مشابه
Comparative Probability Orders and the Flip Relation
In this paper we study the flip relation on the set of comparative probability orders on n atoms introduced by Maclagan (1999). With this relation the set of all comparative probability orders becomes a graph Gn. Firstly, we prove that any comparative probability order with an underlying probability measure is uniquely determined by the set of its neighbours in Gn. This theorem generalises the ...
متن کاملoptimal joint survival probability of xl reinsurance contracts in iran insurance company
اگر تنها یک صنعت جهت حفظ تعادل در بازار جهانی ضروری باشد، می توان ادعا نمود که آن صنعت بیمه است. صنعت بیمه بدون کمک صنعت بیمه اتکایی قادر به انجام وظیفه خویش نخواهد بود. اکثر تحقیقات انجام گرفته در زمینه بیمه اتکایی تنها با در نظر گرفتن منافع شرکت بیمه شده بوده است و منافع شرکت بیمه گر اتکایی کمتر مورد توجه بوده است. در این رساله با در نظر گرفتن منافع همزمان هر دو شرکت بیمه گذار اصلی و بیمه گر ...
15 صفحه اولOn the Number of Facets of Polytopes Representing Comparative Probability Orders
Fine and Gill [4] introduced the geometric representation for those comparative probability orders on n atoms that have an underlying probability measure. In this representation every such comparative probability order is represented by a region of a certain hyperplane arrangement. Maclagan [12] asked how many facets a polytope, which is the closure of such a region, might have. We prove that t...
متن کاملSimplicial Complexes Obtained from Qualitative Probability Orders
Edelman & Fishburn (2006) initiated the study of abstract simplicial complexes which are initial segments of qualitative probability orders. By their nature they are combinatorial generalizations of threshold complexes, however they have not been studied before. In this paper we prove that the class of initial segments of qualitative probabilities is a new class, different from all the classic ...
متن کاملFlexible estimation of joint probability and joint cumulative density functions
The aim of this reported work is to extend a recent, simple and effective algorithm for the estimation of the probability density function and cumulative density function to the case of bidimensional random vectors. The algorithm is based on an information maximisation approach. The nonlinear bidimensional function involved in the algorithm is adaptively modified during learning and is implemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 1977
ISSN: 0091-1798
DOI: 10.1214/aop/1176995843